Software Implementation of Genus-2 Hyperelliptic Curve Cryptosystems Over Prime Fields
نویسندگان
چکیده
This paper describes the system parameters and software implementation of a HECDSA cryptosystem based on genus-2 hyperelliptic curves over prime fields. We show how to reduce the computational complexity for special cases and compare the given cryptosystem with the well-known ECDSA cryptosystem based on elliptic curves.
منابع مشابه
Efficient explicit formulae for genus 3 hyperelliptic curve cryptosystems over binary fields
The ideal class groups of hyperelliptic curves(HECs) can be used in cryptosystems based on the discrete loga-rithm problem. Recent developments of computational technolo-gies for scalar multiplications of divisor classes have shown thatthe performance of hyperelliptic curve cryptosystems (HECC) iscompatible to that of elliptic curve cryptosystems (ECC). Espe-cially, genu...
متن کاملComparative Analysis of Higher Genus Hyperelliptic Curve Cryptosystems over Finite Field Fp
The performance analysis of Hyperelliptic Curve Cryptosystems (HECC) over prime fields (Fp) of genus 5 and 6 are discussed in this paper. We have implemented a HECC system of genus 5 & 6 in a Intel Pentium III Celeron Processor @ 933 MHz speed with 256 MB RAM in Java 1.5. We have also compared their efficiency on the parameters of time taken for divisor generation, key generation, encryption an...
متن کاملComparative Study of Hyperelliptic Curve Cryptosystem over Prime Field and Its Survey
Public key cryptography is the famous cryptography technique used in many corporate sectors for developing software to provide security services. Hyperelliptic Curve Cryptosystem (HECC) is one of the public key cryptographic technique, an expansion of Elliptic Curve Cryptography which offers the similar level of security compared with other cryptosystems such as RSA, ECC and DSA. HECC supervise...
متن کاملImprovements of Addition Algorithm on Genus 3 Hyperelliptic Curves and Their Implementation
Genus 3 hyperelliptic curve cryptosystems are capable of fast-encryption on a 64-bit CPU, because a 56-bit field is enough for their definition fields. Recently, Kuroki et al. proposed an extension of the Harley algorithm, which had been known as the fastest addition algorithm of divisor classes on genus 2 hyperelliptic curves, on genus 3 hyperelliptic curves and Pelzl et al. improved the algor...
متن کاملA Weil Descent Attack against Elliptic Curve Cryptosystems over Quartic Extension Fields
This paper shows that many of elliptic curve cryptosystems over quartic extension fields of odd characteristics are reduced to genus two hyperelliptic curve cryptosystems over quadratic extension fields. Moreover, it shows that almost all of the genus two hyperelliptic curve cryptosystems over quadratic extension fields of odd characteristics come under Weil descent attack. This means that many...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008